Harmonic Mean Projection Shape Transform for Leaf Classification
نویسندگان
چکیده
منابع مشابه
Harmonic Shape Histograms for 3D Shape Classification and Retrieval
In this paper, we present a novel approach towards 3D shape recognition and retrieval using histograms of rotation invariant local features. Features are extracted for every point of voxelized 3D shape objects by use of functions on spheres which are invariant towards rotation of the object. The fast computation of the local features is performed via convolution methods in frequency space. Hist...
متن کاملContour-Based Corner Detection and Classification by Using Mean Projection Transform
Image corner detection is a fundamental task in computer vision. Many applications require reliable detectors to accurately detect corner points, commonly achieved by using image contour information. The curvature definition is sensitive to local variation and edge aliasing, and available smoothing methods are not sufficient to address these problems properly. Hence, we propose Mean Projection ...
متن کاملShape and Texture Based Plant Leaf Classification
This article presents a novel method for classification of plants using their leaves. Most plant species have unique leaves which differ from each other by characteristics such as the shape, colour, texture and the margin. The method introduced in this study proposes to use two of these features: the shape and the texture. The shape-based method will extract the contour signature from every lea...
متن کاملA 3D Shape Descriptor Based on Hadamard Transform and Spherical Harmonic Transform
Shape matching plays an important role in many application fields. In this paper, we propose a novel rotation invariant 3D shape descriptor based on Hadamard transform and spherical harmonic transform. In our method, a 3D model is represented as a collection of spherical functions to preserve shape information as much as possible, and the shape similarity is directly defined by the difference o...
متن کاملProjection Retrieval for Classification
In many applications, classification systems often require human intervention in the loop. In such cases the decision process must be transparent and comprehensible, simultaneously requiring minimal assumptions on the underlying data distributions. To tackle this problem, we formulate an axis-aligned subspace-finding task under the assumption that query specific information dictates the complem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2020
ISSN: 1549-3636
DOI: 10.3844/jcssp.2020.1212.1219